Crossing the Bridge at Night
نویسنده
چکیده
We solve the general case of the bridge-crossing puzzle. 1 The Puzzle Four people begin on the same side of a bridge. You must help them across to the other side. It is night. There is one flashlight. A maximum of two people can cross at a time. Any party who crosses, either one or two people, must have the flashlight to see. The flashlight must be walked back and forth, it cannot be thrown, etc. Each person walks at a different speed. A pair must walk together at the rate of the slower person’s pace, based on this information: Person 1 takes t1 = 1 minutes to cross, and the other persons take t2 = 2 minutes, t3 = 5 minutes, and t4 = 10 minutes to cross, respectively. The most obvious solution is to let the fastest person (person 1) accompany each other person over the bridge and return alone with the flashlight. We write this schedule as + {1, 2}− 1 + {1, 3}− 1 + {1, 4}, denoting forward and backward movement by + and −, respectively. The total duration of this solution is t2 + t1 + t3 + t1 + t4 = 2t1 + t2 + t3 + t4 = 19 minutes. The interesting twist of the puzzle is that the obvious solution is not optimal. A second thought reveals that it might pay off to let the two slow persons (3 and 4) cross the bridge together, to avoid having both terms t3 and t4 in the total time. However, starting with + {3, 4}− 3 + · · · or + {3, 4}− 4 + · · · incurs the penalty of having person 3 or person 4 cross at least three times in total. The correct solution in this case is to let persons 3 and 4 cross in the middle: + {1, 2}− 1 + {3, 4}− 2 + {1, 2}, with a total time of t2 + t1 + t4 + t2 + t2 = t1 + 3t2 + t4 = 17. 1
منابع مشابه
Stick Numbers of 2-bridge Knots and Links
Negami found an upper bound on the stick number s(K) of a nontrivial knot K in terms of the minimal crossing number c(K) of the knot, which is s(K) ≤ 2c(K). Furthermore, McCabe proved that s(K) ≤ c(K) + 3 for a 2-bridge knot or link, except in the cases of the unlink and the Hopf link. In this paper we construct any 2-bridge knot or link K of at least six crossings by using only c(K) + 2 straig...
متن کاملRamsey Numbers and Other Knot Invariants
We make use of a particular linear spatial embedding, the cyclic polytope, in an exploration of bounds on the Ramsey number of knots. Using arc presentations to simplify knotted cycles of this embedding, we examine the relationships between the Ramsey number, bridge number, crossing number, stick number and arc index of knots. In particular we show the Ramsey number is at least as large as the ...
متن کاملThe Activation Gate of a Voltage-Gated K+ Channel Can Be Trapped in the Open State by an Intersubunit Metal Bridge
Voltage-activated K+ channels are integral membrane proteins containing a potassium-selective transmembrane pore gated by changes in the membrane potential. This activation gating (opening) occurs in milliseconds and involves a gate at the cytoplasmic side of the pore. We found that substituting cysteine at a particular position in the last transmembrane region (S6) of the homotetrameric Shaker...
متن کاملBoundary Slopes of 2-Bridge Links Determine the Crossing Number
A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of ∂M . We derive a formula for the boundary slope of a diagonal surface in the exterior of a 2-bridge link which is analogous to the formula for the boundary slope of a 2-bridge knot found b...
متن کاملComprehensive Study of the Possibility of Day - Night Effect Enhancement
A set of quantitative predictions for the D-N asymmetry in the Super Kamiokande detector is presented. For these predictions, neutrino events are collected in “samples” defined by the trajectories in the Earth of the corresponding solar neutrinos. The more important samples considered here are: the full sample of neutrinos detected at night, the sample of night neutrinos which cross the Earth c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 78 شماره
صفحات -
تاریخ انتشار 2002